The N-dimensional Map Maker Algorithm

نویسنده

  • John R Rankin
چکیده

The Map Maker algorithm which converts survey data into geometric data with 2-dimensional Cartesian coordinates has been previously published. Analysis of the performance of this algorithm is continuing. The algorithm is suitable for generating 2D maps and it would be helpful to have this algorithm generalized to generate 3D and higher dimensional coordinates. The trigonometric approach of the Map Maker algorithm does not extend well into higher dimensions however this paper reports on an algebraic approach which solves the problem. A similar algorithm called the Coordinatizator algorithm has been published which converts survey data defining a higher dimensional space of measured sites into the lowest dimensionalcoordinatization accurately fitting the data. Therefore the Coordinatizator algorithm is not a projection transformation whereas the n-dimensional Map Maker algorithm is.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Map-merging in Multi-robot Simultaneous Localization and Mapping Process Using Two Heterogeneous Ground Robots

In this article, a fast and reliable map-merging algorithm is proposed to produce a global two dimensional map of an indoor environment in a multi-robot simultaneous localization and mapping (SLAM) process. In SLAM process, to find its way in this environment, a robot should be able to determine its position relative to a map formed from its observations. To solve this complex problem, simultan...

متن کامل

A Fuzzy Algorithm for the m-Machine, n-Job Flow Shop Sequencing Problem

Flow shop sequencing problem is included in NP-hard problems and a number of heuristic methods have been developed to solve it. Most of these methods are offered for the crisp processing time. However fuzzy algorithm is appropriate for the problems with fuzzy processing time. This paper presents a method in which an algorithm is used to minimize make span of flow shop with fuzzy processing time...

متن کامل

A Fuzzy Algorithm for the m-Machine, n-Job Flow Shop Sequencing Problem

Flow shop sequencing problem is included in NP-hard problems and a number of heuristic methods have been developed to solve it. Most of these methods are offered for the crisp processing time. However fuzzy algorithm is appropriate for the problems with fuzzy processing time. This paper presents a method in which an algorithm is used to minimize make span of flow shop with fuzzy processing time...

متن کامل

Combination of Artificial Neural Network and Genetic Algorithm to Inverse Source Parameters of Sefid-Sang Earthquake Using InSAR Technique and Analytical Model Conjunction

In this study, an inversion method is conducted to determine the focal mechanism of Sefid-Sang fault by comparing interferometric synthetic aperture radar (InSAR) technique and dislocation model of earthquake deformation. To do so, the Sentinel-1A acquisitions covering the fault and its surrounding area are processed to derive the map of line of sight (LOS) displacement over the study area. The...

متن کامل

Publication 4 Probabilistic Measures for Responses of Self−Organizing Map Units

The Self-Organizing Map (SOM) is a widely used data visualization tool in engineering applications. The algorithm performs a non-linear mapping from a highdimensional data space to a low-dimensional space, which is typically a two-dimensional, rectangular grid. This makes it possible to present multidimensional data in two dimensions. Often the model vectors of the SOM and a new data sample nee...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014